Compression algorithm for discrete light-cone quantization.
نویسندگان
چکیده
We adapt the compression algorithm of Weinstein, Auerbach, and Chandra from eigenvectors of spin lattice Hamiltonians to eigenvectors of light-front field-theoretic Hamiltonians. The latter are approximated by the standard discrete light-cone quantization technique, which provides a matrix representation of the Hamiltonian eigenvalue problem. The eigenvectors are represented as singular value decompositions of two-dimensional arrays, indexed by transverse and longitudinal momenta, and compressed by truncation of the decomposition. The Hamiltonian is represented by a rank-four tensor that is decomposed as a sum of contributions factorized into direct products of separate matrices for transverse and longitudinal interactions. The algorithm is applied to a model theory to illustrate its use.
منابع مشابه
Supersymmetric Two-dimensional Qcd at Finite Temperature *
Light-cone coordinates and supersymmetric discrete light-cone quantization are used to analyze the thermodynamics of two-dimensional supersymmetric quantum chromodynamics with a Chern–Simons term in the large-Nc approximation. This requires estimation of the entire spectrum of the theory, which is done with a new algorithm based on Lanczos iterations. Although this work is still in progress, so...
متن کاملPauli–Villars regularization in DLCQ
Abstract. Calculations in a (3+1)-dimensional model indicate that Pauli-Villars regularization can be combined with discrete light-cone quantization (DLCQ) to solve at least some field theories nonperturbatively. Discrete momentum states of Pauli-Villars particles are included in the Fock basis to automatically generate needed counterterms; the resultant increase in basis size is found acceptab...
متن کاملImplementation of VlSI Based Image Compression Approach on Reconfigurable Computing System - A Survey
Image data require huge amounts of disk space and large bandwidths for transmission. Hence, imagecompression is necessary to reduce the amount of data required to represent a digital image. Thereforean efficient technique for image compression is highly pushed to demand. Although, lots of compressiontechniques are available, but the technique which is faster, memory efficient and simple, surely...
متن کاملThe Jpeg Image Compression Algorithm
The basis for the JPEG algorithm is the Discrete Cosine Transform (DCT) which extracts spatial frequency information from the spatial amplitude samples. These frequency components are then quantized to eliminate the visual data from the image that is least perceptually apparent, thereby reducing the amount of information that must be stored. The redundant properties of the quantized frequency s...
متن کاملImage Compression using Fusion of Hybrid Wavelet Transform and Vector Quantization
This paper proposes novel lossy image compression technique using hybrid wavelet transform and vector quantization. First hybrid wavelet transform consisting of two different component transforms is generated and applied on color images. Discrete Kekre transform (DKT) and Discrete Cosine transform (DCT) play role of base and local transform respectively in hybrid wavelet transform. In transform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 88 6 شماره
صفحات -
تاریخ انتشار 2013